On the critical group of graph Möbius ladder
نویسندگان
چکیده
منابع مشابه
Orientable biembeddings of cyclic Steiner triple systems from current assignments on Möbius ladder graphs
We give a characterization of a current assignment on the bipartite Möbius ladder graph with 2n + 1 rungs. Such an assignment yields an index one current graph with current group Z12n+7 that generates an orientable face 2-colorable triangular embedding of the complete graph K12n+7 or, equivalently, an orientable biembedding of two cyclic Steiner triple systems of order 12n+7. We use our charact...
متن کاملSmith forms for adjacency matrices of circulant graphs
We calculate the Smith normal form of the adjacency matrix of each of the following graphs or their complements (or both): complete graph, cycle graph, square of the cycle, power graph of the cycle, distance matrix graph of cycle, Andrásfai graph, Doob graph, cocktail party graph, crown graph, prism graph, Möbius ladder. The proofs operate by finding the abelianisation of a cyclically presented...
متن کاملGeneralized Möbius Ladder and Its Metric Dimension
In this paper we introduce generalized Möbius ladder Mm,n and give its metric dimension. Moreover, it is observed that, depending on even and odd values of m and n, it has two subfamilies with constant metric dimensions.
متن کاملThe birank number of ladder, prism and Mobius ladder graphs
Given a graph G, a function f : V (G)→ {1, 2, ..., k} is a k-biranking of G if f(u) = f(v) implies every u-v path contains vertices x and y such that f(x) > f(u) and f(y) < f(u). The birank number of a graph, denoted bi(G), is the minimum k such that G has a k-biranking. In this paper we determine the birank numbers for ladder, prism, and Möbius ladder graphs.
متن کاملUnavoidable parallel minors of 4-connected graphs
A parallel minor is obtained from a graph by any sequence of edge contractions and parallel edge deletions. We prove that, for any positive integer k, every internally 4-connected graph of sufficiently high order contains a parallel minor isomorphic to a variation of K4,k with a complete graph on the vertices of degree k, the k-partition triple fan with a complete graph on the vertices of degre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 36 شماره
صفحات -
تاریخ انتشار 2006